Smooth reverse subdivision

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smooth reverse subdivision

In this paper we present a new multiresolution framework that takes into consideration reducing the coarse points’ energy during decomposition. We start from initial biorthogonal filters to include energy minimization in multiresolution. Decomposition and reconstruction are main operations for any multiresolution representation. We formulate decomposition as smooth reverse subdivision, based on...

متن کامل

Smooth reverse Loop and Catmull-Clark subdivision

In this paper we present a new multiresolution technique for general topology surfaces based on reversing subdivision with energy minimization. We first introduce a general reverse subdivision approach that starts from a trial set of biorthogonal multiresolution filters and refines the resulting coarse points using local masks. The refinement step tries to find a good approximation of the fine ...

متن کامل

REVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES

Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...

متن کامل

Reverse Catmull-Clark Subdivision

Reverse subdivision consists in constructing a coarse mesh of a model from a finer mesh of this same model. In this paper, we give formulas for reverse Catmull-Clark subdivision. These formulas allow the constructing of a coarse mesh for almost all meshes. The condition for being able to apply these formulas is that the mesh to be reversed must be generated by the subdivision of a coarse mesh. ...

متن کامل

Reverse Subdivision for Optimizing Visibility Tests

Certain applications require knowledge of whether two entities are visible to each other over a terrain, determined using a line-of-sight computation. Several fast algorithms exist for terrain line-of-sight computations. However, performing numerous line-of-sight computations, particularly over a large terrain data set, can be highly resource-intensive (in run time and/or memory). Methods from ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Graphics

سال: 2009

ISSN: 0097-8493

DOI: 10.1016/j.cag.2009.03.012